An Alternative Implementation of BDD - Packages byMulti - Operand Synthesis
نویسندگان
چکیده
In this paper we present a new approach for the realization of a BDD-package. This approach does not depend on recursive synthesis operations (i.e. the ternary If-Then-Else-operator (ITE)) to perform manipulations of Boolean functions; instead our basic operation MORE is based on exchanges of neighbouring variables and existential quantiication. It is capable of combining an arbitrary number of Boolean functions in parallel. We discuss the diierence between MORE and ITE and give experimental results to show the advantages of our implementation approach with respect to size and runtime.
منابع مشابه
An Alternative Implementation of BDD - Packages byMulti -
In this paper we present a new approach for the realization of a BDD-package. This approach does not depend on recursive synthesis operations (i.e. the ternary If-Then-Else-operator (ITE)) to perform manipulations of Boolean functions; instead our basic operation MORE is based on exchanges of neighbouring variables and existential quantiication. It is capable of combining an arbitrary number of...
متن کاملAn enhanced component connection method for conversion of fault trees to binary decision diagrams
Fault Tree Analysis (FTA) is widely applied to assess the failure probability of industrial systems. Many computer packages are available which are based on conventional Kinetic Tree Theory methods. When dealing with large (possibly non-coherent) fault trees, the limitations of the technique in terms of accuracy of the solutions and the efficiency of the processing time becomes apparent. Over r...
متن کاملMINCE: A Static Global Variable-Ordering for SAT Search and BDD Manipulation
The increasing popularity of SAT and BDD techniques in formal hardware verification and automated synthesis of logic circuits encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponential in the worst-case, the structure of real-world instances is a natural source of improvements. While SAT and BDD techniques are often presented as mutually exclusive alter...
متن کاملComputing Boolean Expressions with OBDDs
We present a method to compute the bdd for an arbitrary Boolean expression, where the operands are themselves bdds. Such expressions are usually computed by the successive application of binary operators. However, cases exist where this method performs wasteful intermediate computations and creates bdd nodes not used in the nal result. In contrast, our method never creates a bdd node unless it ...
متن کاملDesign of Experiments for Evaluation of BDD Packages Using Controlled Circuit Mutations
Despite more than a decade of experience with the use of standardized benchmark circuits, meaningful comparisons of EDA algorithms remain elusive. In this paper, we introduce a new methodology for characterizing the performance of Binary Decision Diagram (BDD) algorithms. Our method involves the synthesis of large equivalence classes of functionally perturbed circuits, based on a known referenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996